Permutation classes and polyomino classes with excluded submatrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximations to Permutation Classes

We investigate a new notion of approximately avoiding a permutation: π almost avoids β if one can remove a single entry from π to obtain a β-avoiding permutation.

متن کامل

Small Permutation Classes

We establish a phase transition for permutation classes (downsets of permutations under the permutation containment order): there is an algebraic number κ, approximately 2.20557, for which there are only countablymany permutation classes of growth rate (StanleyWilf limit) less than κ but uncountably many permutation classes of growth rate κ, answering a question of Klazar. We go on to completel...

متن کامل

Deflatability of permutation classes

A permutation class is said to be deflatable if its simple permutations are contained within a proper subclass. Deflatable classes are often easier to describe, analyze and enumerate than their non-deflatable counterparts. This paper presents theorems guaranteeing the non-deflatability of principal classes, constructs an infinite family of deflatable principal classes, and provides examples of ...

متن کامل

Juxtaposing Catalan Permutation Classes with Monotone Ones

This talk describes a clean and unified way to enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc is a permutation of length three and xy is a permutation of length two. The main tools are Dyck paths, decorated by sequences of points, and context free grammars, used afterwards to enumerate these decorated Dyck paths. Juxtapositions are a simple special case of p...

متن کامل

Combinatorial specification of permutation classes †

This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is achieved considering both pattern avoidance and pattern containment constraints in permutations. The obtained specification yields a system of equ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Structures in Computer Science

سال: 2015

ISSN: 0960-1295,1469-8072

DOI: 10.1017/s0960129515000250